Limit theorems for some functionals with heavy tails of a discrete time Markov chain
نویسندگان
چکیده
منابع مشابه
8 Limit Theorems for Additive Functionals of a Markov Chain
Consider a Markov chain {X n } n≥0 with an ergodic probability measure π. Let Ψ a function on the state space of the chain, with α-tails with respect to π, α ∈ (0, 2). We find sufficient conditions on the probability transition to prove convergence in law of N 1/α N n Ψ(X n) to a α-stable law. A " martingale approximation " approach and " coupling " approach give two different sets of condition...
متن کامل2 00 9 Limit Theorems for Additive Functionals of a Markov Chain
Consider a Markov chain {X n } n≥0 with an ergodic probability measure π. Let Ψ be a function on the state space of the chain, with α-tails with respect to π, α ∈ (0, 2). We find sufficient conditions on the probability transition to prove convergence in law of N 1/α N n Ψ(X n) to an α-stable law. A " martingale approximation " approach and " coupling " approach give two different sets of condi...
متن کاملanalysis of ruin probability for insurance companies using markov chain
در این پایان نامه نشان داده ایم که چگونه می توان مدل ریسک بیمه ای اسپیرر اندرسون را به کمک زنجیره های مارکوف تعریف کرد. سپس به کمک روش های آنالیز ماتریسی احتمال برشکستگی ، میزان مازاد در هنگام برشکستگی و میزان کسری بودجه در زمان وقوع برشکستگی را محاسبه کرده ایم. هدف ما در این پایان نامه بسیار محاسباتی و کاربردی تر از روش های است که در گذشته برای محاسبه این احتمال ارائه شده است. در ابتدا ما نشا...
15 صفحه اولLimit theorems for discrete-time metapopulation models
We describe a class of one-dimensional chain binomial models of use in studying metapopulations (population networks). Limit theorems are established for time-inhomogeneous Markov chains that share the salient features of these models. We prove a law of large numbers, which can be used to identify an approximating deterministic trajectory, and a central limit theorem, which establishes that the...
متن کاملArrival probability in the stochastic networks with an established discrete time Markov chain
The probable lack of some arcs and nodes in the stochastic networks is considered in this paper, and its effect is shown as the arrival probability from a given source node to a given sink node. A discrete time Markov chain with an absorbing state is established in a directed acyclic network. Then, the probability of transition from the initial state to the absorbing state is computed. It is as...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ESAIM: Probability and Statistics
سال: 2014
ISSN: 1292-8100,1262-3318
DOI: 10.1051/ps/2013043